A new computational method for cable theory problems
نویسندگان
چکیده
منابع مشابه
A new computational method for cable theory problems.
We discuss a new computational procedure for solving the linear cable equation on a tree of arbitrary geometry. The method is based on a simple set of diagrammatic rules implemented using an efficient computer algorithm. Unlike most other methods, this technique is particularly useful for determining the short-time behavior of the membrane potential. Examples are presented and the convergence a...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA Computational Method for Solving Optimal Control Problems and Their Applications
In order to obtain a solution to an optimal control problem, a numerical technique based on state-control parameterization method is presented. This method can be facilitated by the computation of performance index and state equation via approximating the control and state variable as a function of time. Several numerical examples are presented to confirm the analytical findings and illus...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 1993
ISSN: 0006-3495
DOI: 10.1016/s0006-3495(93)81370-5